Bounded-space online bin cover
نویسندگان
چکیده
In this paper, we look at the online bounded-space bin cover problem and show how we can use the language of Markov chains to model and analyze the problem. We will use the insights given by the Markov chains to design an algorithm for the online bounded-space bin cover problem. The algorithm is a heuristic that we create by simplifying the Markov chain. We also show how we can use simple methods to improve the efficiency of the algorithm. Finally, we will analyze our algorithm and compare it to a well known online bin cover algorithm.
منابع مشابه
Using Markov Chains To Design Algorithms For Bounded-Space On-Line Bin Cover
We show how the on-line bounded-space bin cover problem can be modeled with a Markov chain. We then use this Markov chain formulation to derive an algorithm for the on-line bounded-space bin cover problem. Our algorithm is designed to perform well in a restrictive environment where it can utilize only very few open bins at each time. We analyze the performance of our algorithm and compare it to...
متن کاملAdmissible and Minimax Estimator of the Parameter $theta$ in a Binomial $Bin( n ,theta)$ distribution under Squared Log Error Loss Function in a Lower Bounded Parameter Space
Extended Abstract. The study of truncated parameter space in general is of interest for the following reasons: 1.They often occur in practice. In many cases certain parameter values can be excluded from the parameter space. Nearly all problems in practice have a truncated parameter space and it is most impossible to argue in practice that a parameter is not bounded. In truncated parameter...
متن کاملOnline Algorithms for 1-Space Bounded 2-Dimensional Bin Packing and Square Packing
In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A sequence of rectangular items (square items) arrive one by one, each item must be packed into a square bin of unit size on its arrival without any information about future items. When packing items, 90◦-rotation is allowed. 1-space bounded means there is only one “active” bin. If the “active” bin cannot acco...
متن کاملOnline Bin Packing with Cardinality Constraints
We consider a one dimensional storage system where each container can store a bounded amount of capacity as well as a bounded number of items k ≥ 2. This defines the (standard) bin packing problem with cardinality constraints which is an important version of bin packing, introduced by Krause, Shen and Schwetman already in 1975. Following previous work on the unbounded space online problem, we e...
متن کاملTwo-Bounded-Space Bin Packing Revisited
We analyze approximation algorithms for bounded-space bin packing by comparing them against the optimal bounded-space packing (instead of comparing them against the globally optimal packing that does not necessarily satisfy the bounded-space constraint). For 2-boundedspace bin packing we construct a polynomial time offline approximation algorithm with asymptotic worst case ratio 3/2, and we sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Scheduling
دوره 12 شماره
صفحات -
تاریخ انتشار 2009